An Efficient Data Cleaning Algorithm through Minimum Spanning Tree for Data Mining
نویسندگان
چکیده
Detecting outliers in database (as unusual objects) using Minimum Spanning Tree is a big desire. It is an important task in wide variety of application areas. In this paper we propose Minimum Spanning Tree based algorithm for detecting outliers. The outliers are detected in the data set based on weight function value (MSTWF). If the noticeable changes occurred in the weight function value, the point (object) associated with the edge is detected as an outlier based on degree number of points.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملMinimum Spanning Tree-based Structural Similarity Clustering for Image Mining with Local Region Outliers
Image mining is more than just an extension of data mining to image domain. Image mining is a technique commonly used to extract knowledge directly from image. Image segmentation is the first step in image mining. We treat image segmentation as graph partitioning problem. In this paper we propose a novel algorithm, Minimum Spanning Tree based Structural Similarity Clustering for Image Mining wi...
متن کاملContent based Sentence Ordering using Spanning Tree Algorithm for Improved Multi Document Summarization
Due to the availability of required information in the web, as multiple documents, the need for summarizing these multiple documents and ordering of the sentences in the summary in an efficient way become a relevant task in data mining. We present a novel sentence ordering method based on maximum cost spanning tree algorithm to improve the readability and cohesion of the summary obtained by ext...
متن کاملPerformanace of Improved Minimum Spanning Tree Based on Clustering Technique
Clustering technique is one of the most important and basic tool for data mining. Cluster algorithms have the ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice. In such clustering algorithms, the search for nearest objects in the construction of minimum spanning trees is the main source of computation
متن کاملIncreasing the Efficiency of the Software Architecture Recovery through Spanning Tree Based Maximal Graph Mining Technique
This paper represents a technique for recovering the Software Architecture based on Graph Pattern Matching by the help of mining techniques. Generally Software Architecture is represented in terms of graphs with set of vertices and edges. Finding the frequent data sets is the major step in the software architecture recovery. Many algorithms are proposed in this context, for example Apriori base...
متن کامل